Large neighborhood local search for the p-median problem
نویسندگان
چکیده
منابع مشابه
Large Neighborhood Search for the P-median Problem
In this paper we consider the well known p-median problem. We study the behavior of the local improvement algorithm with a new large neighborhood. Computational experiments on the difficult instances show that the algorithm with the neighborhood is fast and finds feasible solutions with small relative error.
متن کاملComplexity of local search for the p-median problem
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding local search problems are PLS-complete. In the average case we note that standard local descent algorithm is polynomial. A relationship between local optima and 0–1 local saddle points is presented.
متن کاملLarge Neighborhood Local Search for the Maximum Set Packing Problem
In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by k. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee (k + 2)/3. This local search algorithm is a special case of a more general procedure that allows to swap up to Θ(log n) elements per iteration. We also design problem instances with...
متن کاملThe Parallel Variable Neighborhood Search for the <Emphasis Type="Italic">p</Emphasis>-Median Problem
The Variable Neighborhood Search (VNS) is a recent metaheuristic that combines series of random and improving local searches based on systematically changed neighborhoods. When a local minimum is reached, a shake procedure performs a random search. This determines a new starting point for running an improving search. The use of interchange moves provides a simple implementation of the VNS algor...
متن کاملHybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem
In this paper, the problem of maximizing the median of a convex combination of vectors having important applications in finance is considered. The objective function is a highly nonlinear, nondifferentiable function with many local minima and the problem was shown to be APX hard. We present two hybrid Large Neighborhood Search algorithms that are based on mixed-integer programs and include a ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2005
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor0501053k